The Minimal Perimeter of a Log-Concave Function
نویسندگان
چکیده
منابع مشابه
Of Minimal Perimeter
The square decomposition problem has applications in a number of areas such as bin packing of flexible objects of fixed area and circuit layout with minimum communication requirements. Our interest in the square decomposition problem arises from the following problem in parallel computation [1]. One wishes to compute a table of all values of a binary function f on the Cartesian product S x T, w...
متن کاملMinimal Perimeter Triangles
1. INTRODUCTION. Physics often provides mathematics not only with a problem, but also with the idea of a solution. Physical reasoning has traditionally been a fruitful source of mathematical invention, having played a key role in some of the main discoveries of Archimedes, Bernoulli, and Riemann, among many others. In this article we give a much more modest example of a mathematical result that...
متن کاملOn Minimal Perimeter Polyminoes
This paper explores proofs of the isoperimetric inequality for 4-connected shapes on the integer grid Z, and its geometric meaning. Pictorially, we discuss ways to place a maximal number unit square tiles on a chess board so that the shape they form has a minimal number of unit square neighbors. Previous works have shown that “digital spheres” have a minimum of neighbors for their area. We here...
متن کاملRegularity for a Log-concave to Log-concave Mass Transfer Problem with near Euclidean Cost
If the cost function is not too far from the Euclidean cost, then the optimal map transporting Gaussians restricted to a ball will be regular. Similarly, given any cost function which is smooth in a neighborhood of two points on a manifold, there are small neighborhoods near each such that a Gaussian restricted to one is transported smoothly to a Gaussian on the other.
متن کاملOn the Product of Log-concave Polynomials
A real polynomial is called log-concave if its coefficients form a log-concave sequence. We give a new elementary proof of the fact that a product of log-concave polynomials with nonnegative coefficients and no internal zero coefficients is again log-concave. In addition, we show that if the coefficients of the polynomial ∏ m∈M(x + m) form a monotone sequence where M is a finite multiset of pos...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2020
ISSN: 2227-7390
DOI: 10.3390/math8081365